FIFO buffers in hot tie sauce

نویسندگان

  • Franck Pommereau
  • Christian Stehno
چکیده

This paper introduces a new semantics for FIFO buffers (usually called channels) in a parallel programming language, B(PN). This semantics is given in terms of M-nets, which form an algebra of labelled high-level Petri nets. The proposed approach uses the asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the original M-net semantics. Channels are now fully expressible within the algebra (it was not the case), they are significantly smaller (in number of places), and they offer several other advantages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RFIFO: “Retreat FIFOs” for the Head-of-Line Blocking problem

Abstract: The Head-of-Line (HoL) blocking problem, which occurs in input-buffered service systems, degrades their performance, especially in “hot-spot” traffic conditions. In this paper, we present a variation of the design of FIFO queues, called “Retreat FIFOs” or “FIFOs with Retreat” (RFIFOs), which significantly improves the performance of plain FIFOs, with respect to the HoL blocking proble...

متن کامل

On the Coverability Problem for Asynchronous Broadcast Networks

We study verification problems for networks in which nodes communicate via asynchronous broadcast messages. This type of communication is achieved by using a distributed model in which nodes have a local buffer. We consider here safety properties expressed as a coverability problem with an arbitrary initial configurations. This formulation naturally models the search of initial topology that ma...

متن کامل

Can Message Buffers Be Axiomatized in Linear Temporal Logic?

Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...

متن کامل

Two-Level FIFO Buffer Design for Routers in On-Chip Interconnection Networks

The on-chip interconnection network (OCIN) is an integrated solution for system-on-chip (SoC) designs. The buffer architecture and size, however, dominate the performance of OCINs and affect the design of routers. This work analyzes different buffer architectures and uses a data-link two-level FIFO (first-in first-out) buffer architecture to implement high-performance routers. The concepts of s...

متن کامل

A column parity based fault detection mechanism for FIFO buffers

This paper presents a low cost fault detection mechanism for FIFO buffers. The scheme is based on column parity maintenance in a single register, which is updated by monitoring the values written to and read from the FIFO memory array. A non-zero column parity when the FIFO is empty, constitutes an indication of fault, and this property is exploited for fault detection. The technique has gains ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001